The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels
نویسندگان
چکیده
The golden code is a full-rate full-diversity space-time code for the two-input two-output channel with good performance but high decoding complexity. The overlaid Alamouti codes were recently proposed as an alternative; in exchange for a slight performance penalty, they have lower decoding complexity on quasistatic channels with QAM alphabets. However, the complexity advantage of the overlaid codes vanishes for time-varying channels. This paper proposes the asymmetric golden code, a novel fullrate and full-diversity space-time code for the two-input two-output channel that offers reduced-complexity decoding on both quasistatic and time-varying channels.
منابع مشابه
Coding and decoding for time-discrete amplitude-continuous memoryless channels
In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is des...
متن کاملA Decision Directed Receiver for Alamouti Coded Ofdm Systems
When the Alamouti code is applied (as a space-time block code) to an OFDM system with transmit diversity, the simple Alamouti decoding requires that each subchannel is flatfading and constant over two symbol periods(Alamouti codeword period). The second requirement makes the Alamouti decoding scheme not suitable for time varying channels. In this paper, we propose a new decision directed receiv...
متن کاملPerformance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding
A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend–Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMC’s). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective...
متن کاملGolden Space-Time Trellis Coded Modulation
In this paper, we present a multidimensional trellis coded modulation scheme for a high rate 2 2 multiple-input multiple-output system over slow fading channels. Set partitioning of the Golden code [9] is designed speci cally to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions and Viterbi algorithm is applied for trellis decoding. In ord...
متن کاملGeneralized Distributive Law for ML Decoding of Space-Time Block Codes
The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Wireless Personal Communications
دوره 58 شماره
صفحات -
تاریخ انتشار 2011